local optimum

英 [ˈləʊkl ˈɒptɪməm] 美 [ˈloʊkl ˈɑːptɪməm]

局部最优;局部极值

化学



双语例句

  1. The particle swarm optimization algorithm which has slow convergence rate and was easily trapping in local optimum was improved.
    针对粒子群算法后期收敛速度较慢,易陷入局部最优的缺点,提出了改进的混合粒子群算法。
  2. But the result easily falls into the local optimum with random initial choice, and more control points are required to assure higher accuracy.
    但随机选取初始种群的遗传算法,容易使得结果陷入局部最优。要达到较高的拟合精度,则需要增加更多的控制顶点。
  3. Simulated annealing was combined to prevent genetic algorithms from local optimum.
    结合模拟退火避免遗传算法陷入局部最优;
  4. Aiming at problem that Particle Swarm Optimization ( PSO) algorithm falls into local optimum easily, this paper presents a PSO algorithm based on sub-region.
    针对粒子群优化(PSO)算法在寻优时容易陷入局部最优的不足,提出一种基于子区域的PSO算法。
  5. When the algorithm is in local optimum, this method can disperse the particles and improve the diversity of the population and avoid premature convergence.
    在算法陷入局部最优时,通过该方法驱散粒子以提高种群多样性,避免产生早熟收敛现象。
  6. The constriction factor Particle Swarm Optimization ( PSO) algorithm is easily trapped in the local optimum and appeared premature convergence.
    收缩因子粒子群优化算法容易陷入局部最优并出现早熟收敛的现象。
  7. Such an algorithm is verified to accelerate convergence process, enhance searching efficiency and solving precision as well as avoid low efficiency and local optimum.
    实例证明该算法求解加速了收敛过程,提高了搜索效率,在避免陷入局部最优的同时提高了求解精度。
  8. This method is fast while avoiding the shortcoming that the G-S result is easy to trap in local optimum.
    该方法不仅具有追迹法计算简单、运算量小的优点,而且克服了G-S算法容易陷入局部最优的缺点。
  9. Most swarm intelligence algorithms fall into local optimum easily, and convergence speed is very slow.
    大多数群体智能算法容易陷入局部最优,且收敛速度较慢。
  10. The new algorithm includes the mutation operator during the running time which can be useful to improve the ability of PSO in breaking away from the local optimum.
    该算法在运行过程中增加了随机变异算子,通过对当前最佳粒子进行随机变异来增强粒子群优化算法跳出局部最优解的能力。
  11. As Particle Swarm Optimization ( PSO) may easily get trapped in a local optimum, an improved PSO based on adaptive dynamic neighborhood and comprehensive learning named ADPSO was proposed.
    为了克服粒子群算法在求解多峰函数时极易陷入局部最优解的缺陷,提出一种基于自适应动态邻居广义学习的改进粒子群算法(ADPSO)。
  12. The dependence of clustering algorithm on initial values is generally liable to stick to a local optimum, therefore makes it difficult to obtain a stable clustering result.
    聚类算法对初始值的依赖性较大,通常容易陷入局部最优,很难得到稳定的聚类结果。
  13. The coordination decomposition planning method is proposed to resolve the conflict in product layer, caused by the variety inequality between combination of local optimum and global optimum.
    提出采用基于分解协调规划法来消解因“局优”组合不等于“全优”而引起的产品层冲突。
  14. BP neural network, as its nature of gradient descent method, is easy to fall into local optimum.
    但BP神经网络本质是梯度下降法,容易陷入局部最优。
  15. The existing independent component analysis ( ICA) methods are easy to strap into local optimum values, so the extracted fetal electrocardiogram ( FECG) is often mixed with some maternal ECG ( MECG).
    现有独立分量分析(ICA)方法易陷入局部极优值,从而使提取出的胎儿心电信号(FECG)中常混有部分母体心电(MECG)。
  16. The experimental result indicates that the modified PSO increases the ability to break away from the local optimum.
    实验结果表明,改进后的粒子群算法防止陷入局部最优的能力有了明显的增强。
  17. Fitting results by Lemke optimization algorithm are better, avoiding local optimum and costing less time;
    基于Lemke的优化算法拟合效果较理想,避免了局部最优,且辨识时间少;
  18. An improved genetic algorithm based on the evolutionarily stable strategy is proposed to avoid the problem of local optimum.
    为了解决传统遗传算法易陷入局部最优解的问题,在借鉴生物学中进化稳定策略的基础上,对传统的遗传算法进行了改进,提出了基于进化稳定策略的遗传算法。
  19. It can help the gradient method to skip the local optimum and achieve the global minimum.
    该算法能帮助梯度法跳出局部最优,获得全局最优解,并对算法的收敛性进行了证明。
  20. But in practical applications, the FCM easily plunges into the local optimum.
    但在实际的应用中,FCM算法却容易陷入局部最优解。
  21. However, the standard Particle Swarm Optimization is easy to fall into local optimum, and slow convergence.
    然而,标准粒子群算法存在容易陷入局部最优,后期收敛过慢等问题。
  22. However, the use of selection bias is accompanied by local optimum andpremature convergence.
    然而,选择偏置的使用伴随着使算法陷入局部最优和早熟收敛的危险。
  23. The system uses the global optimization search method, which can avoid the low efficiency and local optimum.
    全局最优化搜索方法,避免陷入局部最优。
  24. Aiming at easy to get into a local optimum, hybrid algorithm have been designed to realize clustering.
    针对易陷入局部最优的不足,设计混合算法实现聚类。
  25. Improved GEP algorithm to improve the efficiency of the algorithm, the optimal solution of the problem is easier to access and avoid local optimum.
    改进的GEP算法,提高了算法的效率,使问题的最优解更容易达到,避免了局部最优。
  26. In the search process, particle swarm may fall into local optimum but not the global optimum.
    粒子群在搜索的过程当中,可能会陷入局部最优但却不是全局最优值的问题。
  27. Proper inertia weight can improve the global search ability of the algorithm and avoid from falling into local optimum.
    而如果惯性权重取值得当,可以使得算法具备更强的全局搜索能力,从而避免陷入局部最优。
  28. Also, the global search characteristics of immune evolutionary algorithm and the local search capacity of particle swarm algorithm have been fully utilized to overcome the dependence of particle swarm optimization on initial swarm and the deficiency of vulnerability to local optimum.
    充分利用了免疫进化算法的全局搜索特性和粒子群算法的局部搜索能力,克服了粒子群寻优中对初始种群的依耐和易陷入局部最优的不足。
  29. However, greedy algorithm, as a heuristic algorithm, can only achieve local optimum, not overall.
    然而贪婪算法是一个启发式算法,仅能达到局部最优,不能保证整体最优。
  30. The same as genetic algorithm, is also prone to premature convergence, local optimum.
    但和遗传算法一样,也易出现早熟现象,陷入局部最优。